Generalized threshold decoding of convolutional codes
نویسنده
چکیده
It is shown that any rate lib systematic convolutional code over GF(p) can be decoded up to its minimum distance with respect to the decoding constraint length by a one-step threshold decoder. It is further shown that this decoding method can be generalized in a natural way to allow "decoding" of a received sequence in its unquantized analog form.
منابع مشابه
Analysis of thresholds for braided block codes in BEC
Low-density parity-check (LDPC) codes, invented by Gallager [2], who described and analyzed a block variant of the codes, arouse great interest of researchers. These codes are widely used in practice since they can be decoded by using relatively simple iterative decoding algorithms. Several modifications of these codes are known, in particular, generalized LDPC codes [3]. In contrast to Gallage...
متن کاملتجزیه و تحلیل عملکرد کدهای کانولوشنال تعریف شده در میدان حقیقی در کانال فیدینگ و در حضور نویز کوانتیزاسیون
Channel coding is one of the techniques used for suppression of fading and channel noise effects. Most of the researches on channel codes have been focused on the codes which are defined on Galois fields. Since two decades ago, using channel codes defined on Real and Complex fields has been considered for joint sourcechannel coding in multimedia transmission; but most of the works have focused ...
متن کاملDecoding Algorithm for Convolutional Codes under Linear Systems Point of View
In this work the output-observability of convolutional codes is examined and a decoding algorithm for convolutional codes using linear algebra techniques is presented. Key–Words: Codes, linear systems, output-observability, generalized inverses.
متن کاملOn the Decoding of Certain Generalized Concatenated Convolutional Codes
Concatenated Convolutional Codes Jung-Fu Cheng [email protected] Abstract Two classes of generalized concatenated (GC) codes with convolutional outer codes are studied. The rst class is based on the classical Plotkin ja bjbj construction. A new suboptimal multi-stage soft decision algorithm is proposed and the corresponding performance bounds are obtained. These codes are shown to achieve...
متن کاملInterative ("turbo") decoding of threshold decodable codes
In this paper we extend the idea of iterative decoding of two–dimensional systematic convolutional codes — so–called ”turbo” codes — to threshold decoding. A threshold decoding algorithm is presented which uses soft information from the channel and a priori values as input and delivers soft outputs. The soft output can be split into three terms. The first two terms represent the soft input incl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 16 شماره
صفحات -
تاریخ انتشار 1970